queue with alternating priority - tradução para russo
2) очередь (требований) с приоритетами
![Commuters at [[Osaka Station]] waiting to board a train. Queues for specific trains are marked by color-coded lines on the platform.](https://commons.wikimedia.org/wiki/Special:FilePath/Osaka Station platform passenger queue 2022-02-03.jpg?width=200 "Commuters at [[Osaka Station]] waiting to board a train. Queues for specific trains are marked by color-coded lines on the platform.")
![1943 [[soup kitchen]] queue in [[Aarhus]], Denmark](https://commons.wikimedia.org/wiki/Special:FilePath/Queue outside a soup kitchen at Klostertorv in Ålborg 1943.jpg?width=200 "1943 [[soup kitchen]] queue in [[Aarhus]], Denmark")
Definição
Wikipédia
In computer science, a priority queue is an abstract data-type similar to a regular queue or stack data structure. Each element in a priority queue has an associated priority. In a priority queue, elements with high priority are served before elements with low priority. In some implementations, if two elements have the same priority, they are served in the same order that they were enqueued in. In other implementations, the order of elements with the same priority is undefined.
While priority queues are often implemented using heaps, they are conceptually distinct from heaps. A priority queue is an abstract data structure like a list or a map; just as a list can be implemented with a linked list or with an array, a priority queue can be implemented with a heap or another method such as an unordered array.
